Reachability problems in low-dimensional nondeterministic polynomial maps over integers
نویسندگان
چکیده
We study reachability problems for various nondeterministic polynomial maps in Z n . prove that the problem very simple three-dimensional affine (with independent variables) is undecidable and PSPACE -hard both two-dimensional one-dimensional quadratic maps. Then we show complexity of without functions form ± x + a 0 lower. In this case any dimension if not fixed, then -complete. Finally extend model by considering as language acceptors universality
منابع مشابه
Reachability Problems in Low-Dimensional Iterative Maps
In this paper we analyse the dynamics of one-dimensional piecewise maps (PAMs). We show that one-dimensional PAMs are equivalent to pseudo-billiard or so called “strange billiard” systems. We also show that the more general class of rational functions leads to undecidability of reachability problem for one-dimensional piecewise maps with a finite number of intervals.
متن کاملThe Emergence of 4-Cycles in Polynomial Maps over the Extended Integers
Let f (x) ∈ Z[x]; for each integer α it is interesting to consider the number of iterates nα , if possible, needed to satisfy f nα (α) = α. The sets {α,f (α), . . . , f nα−1(α)} generated by the iterates of f are called cycles. For Z[x] it is known that cycles of length 1 and 2 occur, and no others. While much is known for extensions to number fields, we concentrate on extending Z by adjoining ...
متن کاملNew Multilinear Maps Over the Integers
In the last few years, cryptographic multilinear maps have proved their tremendous potential as building blocks for new constructions, in particular the first viable approach to general program obfuscation. After the first candidate construction by Garg, Gentry and Halevi (GGH) based on ideal lattices, a second construction over the integers was described by Coron, Lepoint and Tibouchi (CLT). H...
متن کاملPractical Multilinear Maps over the Integers
Extending bilinear elliptic curve pairings to multilinear maps is a long-standing open problem. The first plausible construction of such multilinear maps has recently been described by Garg, Gentry and Halevi, based on ideal lattices. In this paper we describe a different construction that works over the integers instead of ideal lattices, similar to the DGHV fully homomorphic encryption scheme...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information & Computation
سال: 2021
ISSN: ['0890-5401', '1090-2651']
DOI: https://doi.org/10.1016/j.ic.2021.104785